1975B - 378QAQ and Mocha's Array - CodeForces Solution

def sorting2(n,a):
    m1=min(a)
    q=[]
    for i in range(n):
        if a[i]%m1!=0:
            q.append(a[i])
    if q==[]: return "yes"
    else:
        m2=min(q)
        c=0
        for j in range(len(q)):
            if q[j]%m2==0:
                c+=1
        if c==len(q):
            return "yes"
        return "no"
t=int(input())
for _ in range(t):
    n=int(input())
    a=list(map(int,input().split()))
    print(sorting2(n,a))